An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes

The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free routing arc examined for three k-ary n-cube topologies: unidirectional, torus-connected bidirectional, and mesh-connected bidirectional. Index firms-Adaptive routing, concurrent computing, deadlock, faulttolerant computing, message passing architecture, virtual channels, virtual networks, wormbole routing.